Efficient algorithms for electric vehicles’ min-max routing problem
نویسندگان
چکیده
An increase in greenhouse gases emission from the transportation sector has led companies and government to elevate support production of electric vehicles (EV). With recent developments urbanization e-commerce, are replacing their conventional fleet with EVs strengthen efforts for sustainable environment-friendly operations. However, deploying a asks efficient routing recharging strategies alleviate limited range mitigate battery degradation rate. In this work, is considered logistic capabilities capacity scarce charging station availability. We introduce min-max vehicle problem (MEVRP) where maximum distance traveled by any EV minimized while considering stations recharging. propose an branch cut framework three-phase hybrid heuristic algorithm that can efficiently solve variety instances. Extensive computational results sensitivity analyses performed corroborate efficiency proposed approach, both quantitatively qualitatively. Finally data-driven simulation implemented robot operating system (ROS) middleware
منابع مشابه
Solving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملEfficient Energy-Optimal Routing for Electric Vehicles
Traditionally routing has focused on finding shortest paths in networks with positive, static edge costs representing the distance between two nodes. Energy-optimal routing for electric vehicles creates novel algorithmic challenges, as simply understanding edge costs as energy values and applying standard algorithms does not work. First, edge costs can be negative due to recuperation, excluding...
متن کاملApproximation Algorithms for the Max-Min Allocation Problem
The Max-Min allocation problem is to distribute indivisible goods to people so as to maximize the minimum utility of the people. We show a (2k − 1)-approximation algorithm for Max-Min when there are k people with subadditive utility functions. We also give a k/α-approximation algorithm (for α ≤ k/2) if the utility functions are additive and the utility of an item for a person is restricted to 0...
متن کاملImproved Approximation Algorithms for the Min-Max Selecting Items Problem
We give a simple deterministic O(logK/ log logK) approximation algorithm for the Min-Max Selecting Items problem, where K is the number of scenarios. While our main goal is simplicity, this result also improves over the previous best approximation ratio of O(logK) due to Kasperski, Kurpisz, and Zieliński (Information Processing Letters (2013)). Despite using the method of pessimistic estimators...
متن کاملSolving Min-Max Multi-Depot Vehicle Routing Problem∗
The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainable operations and computers
سال: 2023
ISSN: ['2666-4127']
DOI: https://doi.org/10.1016/j.susoc.2023.07.002